package com.agan.aganalgorithm.titles;

/**
 * @author agan
 * @ClassName DemoKuaiPai
 * @Description
 * @Date 2021/3/31 10:32 上午
 **/
public class DemoKuaiPai {

    public static void main(String[] args){
        int[] numbers = new int[]{1,23,12,5,35,23,2};
        System.out.println(numbers.length);
        quickSort(numbers,0,numbers.length-1);
    }

    public static  void quickSort(int[] arr,int start,int end){
        //当开始位置小于结束位置（数组有数据）
        if(start < end){
            //首先基数
            int startd = arr[start];
            //记录需要排序的下标
            int low =start;
            int high = end;
            while (low < high){
                

            }

        }

    }

}
